Using quasigroups for one one secure encoding
نویسندگان
چکیده
In this article we apply a method for encrypting messages based on the properties of the quasigroups According to the analysis given in the article the method is extremely secure Beside that the plain text and its cipher text are of the same length and the encoding is of stream nature guarantying a very fast implementation AMS Mathematics Subject Classi cation A P N
منابع مشابه
Using Quasigroups for Generating Pseudorandom Numbers
This paper presents an algorithm for generating pseudorandom numbers using quasigroups. Random numbers have several applications in the area of secure communication. The proposed algorithm uses a matrix of size n x n which is pre-generated and stored. The quality of random numbers generated is compared with other pseudorandom number generator using Marsaglia’s Diehard battery of tests.
متن کاملDesign of crypto primitives based on quasigroups
Today, the security of the modern world is undoubtedly dependent on the cryptographic primitives built into the various protocols used for secure communication. Let us mention here the most important, like block ciphers, stream ciphers, digital signatures and encryption schemes, hash functions, pseudo random number generators, ... The design of these, and many other crypto primitives, uses di e...
متن کاملAn Improved 3-Quasigroup based Encryption Scheme
The Crypto-community is always in search of new strong crypto-primitives to handle the present security threats and for providing efficient secure digital communication. One of the main goals of the cryptographer is to make an encryption scheme computationally fast with optimized use of memory and high cryptographic complexity. In this direction n-quasigroups (n = 2, 3) are considered as a clas...
متن کاملRight Product Quasigroups and Loops
Right groups are direct products of right zero semigroups and groups and they play a significant role in the semilattice decomposition theory of semigroups. Right groups can be characterized as associative right quasigroups (magmas in which left translations are bijective). If we do not assume associativity we get right quasigroups which are not necessarily representable as direct products of r...
متن کاملOn the Randomness and Regularity of Reduced Edon-R Compression Function
EDON-R is one of the candidate hash functions for the ongoing NIST competition for the next cryptographic hash standard called SHA-3. Its construction is based on algebraic properties of non-commutative and non-associative quasigroups of orders 2 and 2. In this paper we are giving some of our results in investigation of the randomness and regularity of reduced EDON-R compression functions over ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997